Optimal redistricting under geographical constraints: Why “pack and crack” does not work.*
نویسندگان
چکیده
We show that even when voters’ preferences are deterministic and known optimal partisan redistricting is not generally obtained by concentrating opponent’s supporters in “unwinnable” districts (“packing”) and spreading one’s own supporters evenly among the other districts in order to produce many slight marginal wins (“cracking”). More generally, we prove that for districting problems with geographical constraints determining an optimal solution is a computationally intractable (NPcomplete) problem.
منابع مشابه
Axiomatic Redistricting*
In a framework with two parties, deterministic voter preferences and geographical constraints, we propose a set of simple axioms and show that they jointly characterize the districting rule that maximizes the number of districts a party can win, given an electoral outcome (the " optimal gerrymandering rule "). As a corollary, we obtain that no districting rule can satisfy our axioms and treat p...
متن کاملiRedistrict: Geovisual analytics for redistricting optimization
Redistricting is a complex and challenging spatial optimization problem. It is to group a set of spatial objects (such as counties) into a given number of geographically contiguous districts while satisfying multiple criteria and constraints such as equal population, compact shape, and more. The various criteria are often difficult to optimize and the number of potential solutions is very large...
متن کاملk-means Approach to Legislative Redistricting
Redistricting is a necessary and important process in any democratic society. Modern tools used by legislatures for apportionment of districts are heavily outdated and rely on archaic algorithms. Most use manual redrawing of lines, while others use simulators that simply switch neighborhoods between districts at random until constraints are met. In this document, I outline an attempt to provide...
متن کاملA computational approach to unbiased districting
In the context of discrete districting problems with geographical constraints, we demonstrate that determining an (ex post) unbiased districting, which requires that the number of representatives of a party should be proportional to its share of votes, turns out to be a computationally intractable (NP-complete) problem. This raises doubts as to whether an independent jury will be able to come u...
متن کامل17.267F13 Democracy In America: Final Paper Student 3 Example
Every ten years, after the census, every legislative district in the United States must be redrawn, and someone must do the drawing. This process is fraught with theoretical, practical, and political concerns, and there is no easy solution. However, while biased redistricting is impossible to eliminate, minimizing the partisan effects is still worthwhile. In particular, redistricting is hard be...
متن کامل